Discrete, depleting chips for obtaining desired service level characteristics

ABSTRACT

The present invention provides discrete, depleting chips for allocating computational resources for obtaining desired service level characteristics, wherein discrete chips deplete from a maximum allocated amount but may, in an optional implementation, be allowed to be replenished through the purchase of additional chips. A number of chips are assigned to a requestor/party, known as a business unit (BU), which could be a department, or group providing like-functionality services. In one implementation, the chips themselves could represent base monetary units integrated over time.

CROSS-REFERENCE TO RELATED APPLICATIONS

This application is related in some aspects to commonly owned patent application Ser. No. 11/756,367, entitled “RESOURCE MANAGEMENT FRAMEWORK”, now U.S. Pat. No. 9,165,266, filed concurrently herewith, the entire contents of which are herein incorporated by reference.

This application is related in some aspects to commonly owned patent application Ser. No. 11/756,360, entitled “METHOD, SYSTEM, AND PROGRAM PRODUCT FOR SELECTING A BROKERING METHOD FOR OBTAINING DESIRED SERVICE LEVEL CHARACTERISTICS”, now U.S. Pat. No. 8,041,599, filed concurrently herewith, the entire contents of which are herein incorporated by reference.

This application is related in some aspects to commonly owned patent application Ser. No. 11/756,374, entitled “NON-DEPLETING CHIPS FOR OBTAINING DESIRED SERVICE LEVEL CHARACTERISTICS”, now U.S. Pat. No. 8,180,660, filed concurrently herewith, the entire contents of which are herein incorporated by reference.

This application is related in some aspects to commonly owned patent application Ser. No. 11/756,325, entitled “FLUID, DEPLETING CHIPS FOR OBTAINING DESIRED SERVICE LEVEL CHARACTERISTICS”, now U.S. Pat. No. 7,840,433, filed concurrently herewith, the entire contents of which are herein incorporated by reference.

FIELD OF THE INVENTION

The present invention generally relates to the brokering of biddable resources (e.g., computational resources). Specifically, the present invention addresses the need for using discrete, depleting chips for obtaining desired service level characteristics.

BACKGROUND OF THE INVENTION

Businesses are experiencing an ever-increasing trend to achieve higher utilization of computing resources. Companies that provide their own IT computing services are being driven to find ways to decrease costs by increasing utilization. Moreover, companies that provide these services are being driven to reduce overhead and become more competitive by increasing utilization of these resources. Numerous studies over the past decade have shown that typical utilization levels of computing resources within service delivery centers, raised floors, and data centers fall between 20% and 80%. This leaves a tremendous amount of white space with which to improve utilization and drive costs down.

These issues are compounded by the fact that, in many instances, multiple parties compete for common resources. Such competition can occur both on an inter-organization level as well as on an intra-organization level (e.g., between business units). To this extent, none of the existing approaches address how much resources a particular party is allowed to consume. That is, none of the existing approaches provide a way to adequately ration a party the computational resources in a way that will fulfill its needs, while not preventing the needs of other parties' from being met. Accordingly, there exists a need in the art to overcome the deficiencies and limitations described hereinabove.

SUMMARY OF THE INVENTION

The application of the present invention generally provides details on the nature of discrete, depleting chips, wherein discrete chips deplete from a maximum allocated amount but may, in an optional implementation, be allowed to be replenished through the purchase of additional chips. A number of chips are assigned to a requestor/party, such as a business unit (BU), which could be a department, or group providing like-functionality services. In one implementation, the chips themselves could represent base monetary units integrated over time.

In this concept, the number of chips is depleted over some period of time, which helps to balance the requestor's relationship with the resource unit broker. That is, when a party bids a certain amount of chips for a computational resource, and that party's bid is accepted, its total quantity of chips will be debited by the amount of chips bid. Using a chip maximum over a finite duration, e.g. 10,000 chips over one month, implies that the requestor has until the end of the period of time to utilize all of its chips to attempt to win bids for elemental bidding resources (EBRs). Again, the requestor may optionally be allowed to acquire additional chips if it depletes it's supply prior to the end of the allocation period. The method of acquiring new chips would depend on existing business policies or practices, and is not the focus of this application. This chip management mechanism would be leveraged in conjunction with the concepts and algorithms provided in other applications, for the purposes of brokering an exchange of chips for EBRs during periods of high resource demand.

A first aspect of the present invention provides a method for allocating a supply of discrete, depleting chips for obtaining desired service level characteristics, comprising: allocating a party a fixed quantity of chips for bidding on a computational resource; receiving a bid for the computational resource using an amount of the fixed quantity of chips pursuant to a discrete event for the computational resource; and debiting the fixed quantity of chips by the amount in response to the party being awarded the computational resource.

A second aspect of the present invention provides a system for allocating a supply of discrete, depleting chips for obtaining desired service level characteristics, comprising: a system for allocating a party a fixed quantity of chips for bidding on a computational resource; a system for receiving a bid for the computational resource using an amount of the fixed quantity of chips pursuant to a discrete event for the computational resource; and a system for debiting the fixed quantity of chips by the amount in response to the party being awarded the computational resource.

A third aspect of the present invention provides a program product stored on a computer readable medium for allocating a supply of discrete, depleting chips for obtaining desired service level characteristics, the computer readable medium comprising program code for causing a computer system to: allocate a party a fixed quantity of chips for bidding on a computational resource; receive a bid for the computational resource using an amount of the fixed quantity of chips pursuant to a discrete event for the computational resource; and debit the fixed quantity of chips by the amount in response to the party being awarded the computational resource.

A fourth aspect of the present invention provides a method for deploying a system for allocating a supply of discrete, depleting chips for obtaining desired service level characteristics, comprising: providing a computer infrastructure being operable to: allocate a party a fixed quantity of chips for bidding on a computational resource; receive a bid for the computational resource using an amount of the fixed quantity of chips pursuant to a discrete event for the computational resource; and debit the fixed quantity of chips by the amount in response to the party being awarded the computational resource.

A fifth aspect of the present invention provides computer software embodied in a propagated signal for allocating a supply of discrete, depleting chips for obtaining desired service level characteristics, the computer software comprising instructions for causing a computer system to: allocate a party a fixed quantity of chips for bidding on a computational resource; receive a bid for the computational resource using an amount of the fixed quantity of chips pursuant to a discrete event for the computational resource; and debit the fixed quantity of chips by the amount in response to the party being awarded the computational resource.

A sixth aspect of the present invention provides a data processing system for allocating a supply of discrete, depleting chips for obtaining desired service level characteristics, comprising: a memory medium; a bus coupled to the memory medium; and a processing unit coupled to the bus, the memory medium comprising program code, which when executed by the processing unit, causes the data processing system to: allocate a party a fixed quantity of chips for bidding on a computational resource; receive a bid for the computational resource using an amount of the fixed quantity of chips pursuant to a discrete event for the computational resource; and debit the fixed quantity of chips by the amount in response to the party being awarded the computational resource.

For each of these aspects, the following additional features/functions can be provided: the party can be a business unit or the like; the bid can be received pursuant to a scheduled auction for the computational resource; the bid can be one of a plurality of bids received pursuant to the scheduled auction for the computational resource; the fixed quantity of chips can be allocated pursuant to a business transaction such as a financial transaction; the bid can be received by a resource unit broker from an agent acting on behalf of the party; the resource unit broker can select from a plurality of available algorithms for identifying a winner of the computational resource, and/or the like.

BRIEF DESCRIPTION OF THE DRAWINGS

These and other features of this invention will be more readily understood from the following detailed description of the various aspects of the invention taken in conjunction with the accompanying drawings in which:

FIG. 1 shows an illustrative resource management framework according to the present invention.

FIG. 2 shows an illustrative graph of an allocation cycle according to the present invention.

FIG. 3 shows an illustrative graph of a ratio of resource allocation according to the present invention.

FIG. 4 shows an illustrative graph of a harvested capacity allocation according to the present invention.

FIG. 5 shows a more detailed computerized implementation of the present invention.

The drawings are not necessarily to scale. The drawings are merely schematic representations, not intended to portray specific parameters of the invention. The drawings are intended to depict only typical embodiments of the invention, and therefore should not be considered as limiting the scope of the invention. In the drawings, like numbering represents like elements.

DETAILED DESCRIPTION OF THE INVENTION

For convenience purposes, the Detailed Description of the Invention has the following sections:

I. General Description

II. Computerized Implementation

I. General Description

As used herein, the following terms have the following definitions:

“Chip” means any unit (virtual or otherwise) that may be exchanged for resources such as IT resources.

“Party” means any individual, group of individuals, department, business unit, cell of a component business model, etc.

“Discrete Event” means a scheduled event such as an auction.

“Fluid Event” means any non-scheduled event such as a random purchase.

“Service Level Characteristic” means any type of computer or IT requirement needed by the business, including any non-functional requirements that specify criteria that can be used to judge the operation of a system, rather than specific behaviors.

“Elemental Bidding Resource (EBR)” means any computational resource (e.g., memory, processing cycles, etc.) sought by a party to accomplish objectives.

As indicated above, the present invention provides details on the nature of discrete, depleting chips, wherein discrete chips deplete from a maximum allocated amount but may, in an optional implementation, be allowed to be replenished through the purchase of additional chips. A number of chips are assigned to a requestor/party, known as a business unit (BU), which could be a department, or group providing like-functionality services. In one implementation, the chips themselves could represent base monetary units integrated over time.

In this concept, the number of chips is depleted over some period of time, which helps to balance the requestor's relationship with the resource unit broker. That is, when a party bids a certain amount of chips for a computational resource, and that party's bid is accepted, its total quantity of chips will be debited by the amount of chips bid. Using a chip maximum over a finite duration, e.g. 10,000 chips over one month, implies that the requestor has until the end of the period of time to utilize all of its chips to attempt to win bids for elemental biddable resources (EBR). Again, the requestor may optionally be allowed to acquire additional chips if it depletes it's supply prior to the end of the allocation period. The method of acquiring new chips would depend on existing business policies or practices, and is not the focus of this application. This chip management mechanism would be leveraged in conjunction with the concepts and algorithms provided in other applications, for the purposes of brokering an exchange of chips for EBRs for periods of high resource demand.

Referring now to FIG. 1, a resource management framework (hereinafter framework 10) is depicted as described in U.S. Pat. No. 9,165,266, which was cross-referenced and incorporated above. As shown, framework 10 is generally comprised of business units 12A-N, buyer's agents 14A-N, resource unit capacity planner 16, resource allocation software 18, optional resource unit change and configuration manager 20, and resource unit broker 28. These components typically leverage additional assets such as chip usage trending 21A-N, requestor chip pool 22A-N, and service level and infrastructure category baseline 24.

An objective of this framework is to reach a means of maximizing utilization of IT Resources among competing consumers such as business units 12A-B by distribution of the decision making/allocation process according to relative needs of applications. Doing so eliminates the need for traditional SLAs, and allows each business unit to make dynamic “free market” decisions as to how best to obtain the service levels required from a highly-commoditized IT service provider.

To this end, business units 12A-N relay their priorities and computing needs to the buyer's agents 14A-N. Buyer's agents 14A-N then determine whether to engage in cooperative or competitive negotiations and implement a request for an EBR on the business units' 12A-N behalf. Various methods can be employed by the resource unit broker 28 to fulfill requests for resources to consumers or business units 12A-N. One method is using non-depleting chips (as further described in U.S. Pat. No. 8,180,660, which was cross-referenced and incorporated above), and yet another involves the use of fluid chips (as further described in U.S. Pat. No. 7,840,433, which was cross-referenced and incorporated above). Another method is described herein and involves using depleting chips for static or discrete events. Regardless, the buyers' agents 14A-N understand the thresholds business units 14A-N are willing to pay, their associated targets for various service level characteristics, and will programmatically employ the most advantageous bidding strategy.

The resource unit capacity planner 16 reports to resource unit brokers 28 (i.e., auctioneers) what resources are available (e.g., infrastructure components) at any given time. Resource allocation software 18 includes products such as Enterprise Workload manager (EWLM), WebSphere XD, and Partition Load Manager (EWLM, Enterprise Workload Manager, WebSphere XD, and Partition Load Manage are trademarks of IBM Corp. in the United States and/or other countries). The goal-oriented policies within these products are updated by inputs from the resource unit broker 28 and/or resource unit broker capacity 16. Change management may be all self-contained in resource allocation software 18, or there may be cases where additional change control needs to be performed. This functionality is provided herein by optional resource unit change and configuration manager 20.

As indicated above, the present invention involves the management and/or allocation of discrete, depleting chips to parties such as business units 12A-N. That is, business units 12A-N will be allocated a certain/fixed quantity of chips pursuant to a business transaction (e.g., a financial transaction). Those chips can then be used for bidding in an attempt to be allocated computational resources. Under an embodiment of the present invention, the chips are considered discrete because they are intended to be used in a scheduled event such as a scheduled auction. In this regard, auction winners are granted resources for known periods of time, and can thus base future decisions on the knowledge that they are ensured the desired resources for the duration of the allocation cycle.

Consider, for the sake of simplicity, the case where only two business units are competing for IT resources. These business units will be known simply as BU1 and BU2, and each is represented by its own respective agent software. In the discrete chip model, again, periodic auctions are held, and winners determined for the duration of the allocation cycle, such that resources are distributed accordingly. Specifically, agents 14A-N will submit bids on behalf of business units 12A-N. Each bid is for an amount (e.g., one or more) of chips that were allocated to business units 12A-N. It should be noted that each business unit 12A-N is not necessarily allocated the same amount of chips. For example, business unit “A” may be able to purchase more chips than business unit “B”. In any event, resource unit broker 28 will act as an auctioneer and determine a winner. As part of its role, resource unit broker 28 will communicate with resource unit capacity planner 16 and resource allocation software 18 as outlined above.

Referring now to FIG. 2, an illustrative graph of an allocation cycle is shown. In this example, for instance, BU1 is the high bidder for resources at time t1. In a fluid event scenario (e.g., an un-scheduled auction) case, this would not guarantee BU1 use of the “won” resource(s) for any particular period of time, but in this discrete chip case, a time guarantee equating to the “allocation cycle” is given. Thus, depending on the allocation strategy, BU1 may have a complete monopoly over the resource(s), or such resources may be shared with BU1 receiving the majority.

It should be noted that the time scale shown in FIG. 2 is not meant to be specific, but rather indicative of a short/long dichotomy between the bid cycle and the overall allocation cycle. Furthermore, in this case, BU1's (and/or BU2's) expenditure of chips equates to a series of discontinuous expenses equating to the amount bid at the end of each respective bid cycle. Note that again, whether or not BU2 is charged for its “losing” bid depends on the various allocation strategies. In some eventualities, it may be charged and in others, not.

Note that for all chip management systems, including this one, cooperative behavior may optionally first be tried before bidding competition ensues. Note furthermore that three allocation strategies follow, and in fact influence, the bidding process. Any of these strategies may be implemented, according to the behavior that is deemed optimal for the adopting organization.

These strategies are as follows:

“Winner Take All” Allocation: In this approach, the business unit with the highest bid is allocated all requested IT resources. No other business units receive IT resources (EBRs), until the next winner is determined at the end of the next bid cycle. With the discrete, depleting chip approach outlined herein, this has the practical effect of determining whichever business unit wins a particular bid cycle will receive full use of the IT resource under bid for the duration of the subsequent allocation cycle. Such a resource (the EBR) could be a given machine, a given number of processors, memory, input/output capability, or any other such elemental bidding resource. It should be noted, of course, that within any given closed system of Business Units, early “wins” of resources within a distribution cycle indicate greater expenditures of chips. Thus, all things being equal, such BUs may have fewer chips with which to compete later in the distribution cycle. For example, heavy bids in a month-long chip distribution cycle may hinder the ability of the BU to compete for resources late in the month.

“Ratio of Resources” Allocation: In this approach, the requested resources are allocated for the full allocation cycle according to a ratio of bids between competing business units. An example of this is shown in FIG. 3 where two competing BUs are bidding on a resource, and the ratio of relative bids at the end of the bid cycle is 2/1 between Business Unit 2 and Business Unit 1, respectively. In this case, BU2 gets 66.7% of the requested resource, and BU1 gets 33.3% of the requested resource. From FIG. 3, it can be observed that the competing business units each get their own share of the overall capacity, regardless of their moment-by-moment computing needs. In this illustrated case, BU1s application runs into a CPU constraint for part of the allocation cycle, as noted by the time during which it is utilizing its share of the capacity at 100%.

“Harvested Capacity (HC)” Allocation: This approach is generally shown in FIG. 4 and has some similarities with the “winner take all” approach; in that the BU placing the highest bid at any given time gets all the capacity it needs for the duration in which its bid is the highest. However, in the harvested capacity approach, any remaining resources after the winner takes what it needs are available and may be “skimmed” for use by other BUs. In this discrete, depleting chip scenario, the differentiation between the “ratio of resources” approach and “harvested capacity” may be viewed through a graphical comparison with the above approach. In the HO approach, BU1's processor resource constraint is eased by permitting BU1 to obtain more than 33.3% of the resources, but only if (as in this case) BU2 is not currently constrained. The down-side to harvested capacity, however, is that more overhead computations may be required to continually calculate the resource availability, and a slight hysteresis may exist wherein the decision to allow BU1 (the bid loser) to take resources at the next incremental moment is based upon BU2's (the bid winner) needs from the just-past incremental moment.

Therefore, the specification and quantification of these discrete, depleting chips may occur through a number of methods, but their measure in use by the system may be thought of as a series of discrete expenditures, in which either the winning bidder only is charged or each BU (winning or losing) is charged, depending on the allocation strategy pursued. As mentioned for other chip strategies (e.g., as incorporated by reference), several fundamental implementation options exist for practical use of this system. In one case, a business unit within an organization may receive through executive sponsor a specified amount of chips for a given period of time, and that is all the chips it receives until the next replenishment date. In another case, a business unit may receive through executive sponsor a specified amount of chips for a given period of time, and then additional chips may be purchased through discretionary expenditures authorized by the business unit. In a third option, the chips may be equated to simple fiscal terms, and the free market will determine the relative “wealth” of competing business units. This last approach would generally be best suited for true competitive situations, in which the BU's are not necessarily part of the same broader organization with shared goals.

II. Computerized Implementation

Referring now to FIG. 5, a more detailed diagram of a computerized implementation 100 of the present invention is shown. As depicted, implementation 100 includes resource unit broker 28 deployed within a computer infrastructure 102. This is intended to demonstrate, among other things, that the present invention could be implemented within a network environment (e.g., the Internet, a wide area network (WAN), a local area network (LAN), a virtual private network (VPN), etc.), or on a stand-alone computer system. In the case of the former, communication throughout the network can occur via any combination of various types of communications links. For example, the communication links can comprise addressable connections that may utilize any combination of wired and/or wireless transmission methods. Where communications occur via the Internet, connectivity could be provided by conventional TCP/IP sockets-based protocol, and an Internet service provider could be used to establish connectivity to the Internet. Still yet, computer infrastructure 102 is intended to demonstrate that some or all of the components of implementation 100 could be deployed, managed, serviced, etc. by a service provider who offers to implement, deploy, and/or perform the functions of the present invention for others.

As shown, resource unit broker 28 includes a processing unit 106, a memory 108, a bus 110, and input/output (I/O) interfaces 112. Further, resource unit broker 28 is shown in communication with external I/O devices/resources 114 and storage system 116. In general, processing unit 106 executes computer program code, such as brokering program 118, which is stored in memory 108 and/or storage system 116. While executing computer program code, processing unit 106 can read and/or write data to/from memory 108, storage system 116, and/or I/O interfaces 112. Bus 110 provides a communication link between each of the components in resource unit broker 28. External devices 114 can comprise any devices (e.g., keyboard, pointing device, display, etc.) that enable a user to interact with resource unit broker 28 and/or any devices (e.g., network card, modem, etc.) that enable resource unit broker 28 to communicate with one or more other computing devices.

Computer infrastructure 102 is only illustrative of various types of computer infrastructures for implementing the invention. For example, in one embodiment, computer infrastructure 102 comprises two or more computing devices (e.g., a server cluster) that communicate over a network to perform the process(es) of the invention. Moreover, resource unit broker 28 is only representative of various possible computer systems that can include numerous combinations of hardware. To this extent, in other embodiments, resource unit broker 28 can comprise any specific purpose computing article of manufacture comprising hardware and/or computer program code for performing specific functions, any computing article of manufacture that comprises a combination of specific purpose and general purpose hardware/software, or the like. In each case, the program code and hardware can be created using standard programming and engineering techniques, respectively. Moreover, processing unit 106 may comprise a single processing unit, or be distributed across one or more processing units in one or more locations, e.g., on a client and server. Similarly, memory 108 and/or storage system 116 can comprise any combination of various types of data storage and/or transmission media that reside at one or more physical locations. Further, I/O interfaces 112 can comprise any system for exchanging information with one or more external device 114. Still further, it is understood that one or more additional components (e.g., system software, math co-processing unit, etc.) not shown in FIG. 5 can be included in resource unit broker 28. However, if resource unit broker 28 comprises a handheld device or the like, it is understood that one or more external devices 114 (e.g., a display) and/or storage system 116 could be contained within resource unit broker 28, not externally as shown.

Storage system 116 can be any type of system (e.g., a database) capable of providing storage for information under the present invention. To this extent, storage system 116 could include one or more storage devices, such as a magnetic disk drive or an optical disk drive. In another embodiment, storage system 116 includes data distributed across, for example, a local area network (LAN), wide area network (WAN) or a storage area network (SAN) (not shown). In addition, although not shown, additional components, such as cache memory, communication systems, system software, etc., may be incorporated into resource unit broker 28. It should be understood that resource unit capacity planner 16, resource allocation software 18, and change and configuration manager 20 have not been shown in FIG. 5 for clarity purposes.

Shown in memory 108 of resource unit broker 28 is brokering program 118, which facilitates the functions of resource unit broker 28 as described herein. It should be understood that brokering program 118 can include any of the subsystems shown in the above-incorporated applications. Those shown in FIG. 5 have been depicted to illustrate the core functions of the discrete, depleting chip model of the present invention. As depicted, brokering program 118 includes allocation system 120, discrete event system 122, request system 124, auction system 126, and chip management system 128. It should be understood that this configuration of functionality is intended to be illustrative only, and that identical or similar functionality could be provided with a different configuration of systems.

In any event, brokering program 118 facilitates the functions as described herein. Specifically, allocation system 120 is configured to allocate a party a fixed quantity of chips for bidding on a computational resource. This can incorporate details of a business transaction between the party and a chip source such as a financial exchange for a fixed quantity of chips. Discrete event system 122 is configured to schedule events such as auctions for computational resources, and can be used in conjunction with any calendar/email application (e.g., Lotus Notes; Lotus, Notes, and Lotus Notes are trademarks of IBM Corp. in the United States and/or other countries) to manage invites and responses, and maintain a calendar of events. Request system 124 is configured to receive and manage bids (from agents on behalf of the parties) for computational resources. As mentioned above, the bids will comprise an amount of the fixed quantity of chips allocated to a party. Auction system 126 will keep track of the bids (and counter bids) and determine a winner of the auction. It can do so using any of the above-referenced (and/or incorporated) strategies and associated algorithms. Chip management system 128 is configured to manage the quantity of chips allocated to the parties, including debiting the fixed quantity of chips allocated to a party by the amount bid by that party in response to the party being awarded the computational resource.

For example, in one embodiment, the invention provides a computer-readable/useable medium that includes computer program code to enable a computer infrastructure to allocate resources using depleting chips. To this extent, the computer-readable/useable medium includes program code that implements the process(es) of the invention. It is understood that the terms computer-readable medium or computer useable medium comprises one or more of any type of physical embodiment of the program code. In particular, the computer-readable/useable medium can comprise program code embodied on one or more portable storage articles of manufacture (e.g., a compact disc, a magnetic disk, a tape, etc.), on one or more data storage portions of a computing device, such as memory 108 (FIG. 5) and/or storage system 116 (FIG. 5) (e.g., a fixed disk, a read-only memory, a random access memory, a cache memory, etc.), and/or as a data signal (e.g., a propagated signal) traveling over a network (e.g., during a wired/wireless electronic distribution of the program code).

In another embodiment, the invention provides a business method that performs the process of the invention on a subscription, advertising, and/or fee basis. That is, a service provider, such as a Solution Integrator, could offer to allocate resources based on non-depleting chips. In this case, the service provider can create, maintain, support, etc., a computer infrastructure, such as computer infrastructure 102 (FIG. 5) that performs the process of the invention for one or more customers. In return, the service provider can receive payment from the customer(s) under a subscription and/or fee agreement and/or the service provider can receive payment from the sale of advertising content to one or more third parties.

In still another embodiment, the invention provides a computer-implemented method for allocating resources based on depleting chips. In this case, a computer infrastructure, such as computer infrastructure 102 (FIG. 5), can be provided and one or more systems for performing the process of the invention can be obtained (e.g., created, purchased, used, modified, etc.) and deployed to the computer infrastructure. To this extent, the deployment of a system can comprise one or more of: (1) installing program code on a computing device, such as resource unit broker 28 (FIG. 5), from a computer-readable medium; (2) adding one or more computing devices to the computer infrastructure; and (3) incorporating and/or modifying one or more existing systems of the computer infrastructure to enable the computer infrastructure to perform the process of the invention.

As used herein, it is understood that the terms “program code” and “computer program code” are synonymous and mean any expression, in any language, code or notation, of a set of instructions intended to cause a computing device having an information processing capability to perform a particular function either directly or after either or both of the following: (a) conversion to another language, code or notation; and/or (b) reproduction in a different material form. To this extent, program code can be embodied as one or more of: an application/software program, component software/a library of functions, an operating system, a basic I/O system/driver for a particular computing and/or I/O device, and the like.

A data processing system suitable for storing and/or executing program code can be provided hereunder and can include at least one processor communicatively coupled, directly or indirectly, to memory element(s) through a system bus. The memory elements can include, but are not limited to, local memory employed during actual execution of the program code, bulk storage, and cache memories that provide temporary storage of at least some program code in order to reduce the number of times code must be retrieved from bulk storage during execution. Input/output or I/O devices (including, but not limited to, keyboards, displays, pointing devices, etc.) can be coupled to the system either directly or through intervening I/O controllers.

Network adapters also may be coupled to the system to enable the data processing system to become coupled to other data processing systems, remote printers, storage devices, and/or the like, through any combination of intervening private or public networks. Illustrative network adapters include, but are not limited to, modems, cable modems and Ethernet cards.

The foregoing description of various aspects of the invention has been presented for purposes of illustration and description. It is not intended to be exhaustive or to limit the invention to the precise form disclosed, and obviously, many modifications and variations are possible. Such modifications and variations that may be apparent to a person skilled in the art are intended to be included within the scope of the invention as defined by the accompanying claims. 

We claim:
 1. A method for allocating a supply of discrete, depleting chips for obtaining desired service level characteristics, comprising: allocating a party a fixed quantity of chips for bidding on a computational resource; allocating a second party a different quantity of chips for bidding on the computational resource; receiving a first bid for the computational resource using an amount of the fixed quantity of chips pursuant to a discrete event for the computational resource and receiving a second bid using an amount of the different quantity of chips pursuant to the discrete event, the first and second bids being received by a resource unit broker, the resource unit broker identifying a winner of the computational resource utilizing a ratio of resources allocation, wherein the winner receives a ratio of the computational resource equal to the ratio of a total bid from all parties, the ratio of the computational resource comprising a percentage of an overall capacity of a CPU resource; wherein the first bid is received from a first agent representing the first party and the second bid is received from a second agent representing the second party, wherein the first and second agent engage in cooperative negotiations on behalf of the first and second party, and wherein the first agent and the second agent comprise buyer's agents; debiting the fixed quantity of chips by the amount of the first bid in response to the first party being awarded the ratio of the computational resource and debiting the different quantity of chips by the amount of the second bid in response to the second party being awarded the ration of the computational resource; receiving a third bid for the computational resource using a portion of the fixed quantity of chips remaining after the debiting; and debiting the fixed quantity of chips remaining after the debiting by the portion in response to the first party being awarded the ratio of the computational resource for the pre-determined duration.
 2. The method of claim 1, the discrete event being a scheduled auction for the computational resource.
 3. The method of claim 2, the bid being one of a plurality of bids received pursuant to the scheduled auction for the computational resource.
 4. The method of claim 1, the allocating comprising allocating the party the fixed quantity of chips pursuant to a business transaction.
 5. The method of claim 4, the business transaction being a financial transaction.
 6. The method of claim 1, the party being a business unit.
 7. The method of claim 1, the resource unit broker selecting one of a plurality of available algorithms for identifying a winner of the computational resource.
 8. A system for allocating a supply of discrete, depleting chips for obtaining desired service level characteristics, comprising: a set of computer devices having at least one computer device, the set of computer devices performing a method, including: allocating a party a fixed quantity of chips for bidding on a computational resource; allocating a second party a different quantity of chips for bidding on the computational resource; first bid for the computational resource using an amount of the fixed quantity of chips pursuant to a discrete event for the computational resource and receiving a second bid using an amount of the different quantity of chips pursuant to the discrete event, the first and second bids being received by a resource unit broker, the resource unit broker identifying a winner of the computational resource utilizing a ratio of resources allocation, wherein the winner receives a ratio of the computational resource equal to the ratio of a total bid from all parties, the ratio of the computational resource comprising a percentage of an overall capacity of a CPU resource; wherein the first bid is received from a first agent representing the first party and the second bid is received from a second agent representing the second party, wherein the first and second agent engage in cooperative negotiations on behalf of the first and second party, and wherein the first agent and the second agent comprise buyer's agents; debiting the fixed quantity of chips by the amount of the first bid in response to the first party being awarded the ratio of the computational resource and debiting the different quantity of chips by the amount of the second bid in response to the second party being awarded the ration of the computational resource; receiving a third bid for the computational resource using a portion of the fixed quantity of chips remaining after the debiting; and debiting the fixed quantity of chips remaining after the debiting by the portion in response to the first party being awarded the ratio of the computational resource for the pre-determined duration.
 9. The system of claim 8, the discrete event being a scheduled auction for the computational resource.
 10. The system of claim 9, the bid being one of a plurality of bids received pursuant to the scheduled auction for the computational resource.
 11. The system of claim 8, the fixed quantity of chips being allocated pursuant to a business transaction.
 12. The system of claim 11, the business transaction being a financial transaction.
 13. The system of claim 8, the party being a business unit.
 14. The system of claim 8, the resource unit broker selecting one of a plurality of available algorithms for identifying a winner of the computational resource.
 15. A program product stored on a non-transitory computer readable storage medium for allocating a supply of discrete, depleting chips for obtaining desired service level characteristics, the computer readable storage medium comprising program code for causing a computer system to: allocate a party a fixed quantity of chips for bidding on a computational resource; allocate a second party a different quantity of chips for bidding on the computational resource; receive a first bid for the computational resource using an amount of the fixed quantity of chips pursuant to a discrete event for the computational resource and receiving a second bid using an amount of the different quantity of chips pursuant to the discrete event, the first and second bids being received by a resource unit broker, the resource unit broker identifying a winner of the computational resource utilizing a ratio of resources allocation, wherein the winner receives a ratio of the computational resource equal to the ratio of a total bid from all parties, the ratio of the computational resource comprising a percentage of an overall capacity of a CPU resource; wherein the first bid is received from a first agent representing the first party and the second bid is received from a second agent representing the second party, wherein the first and second agent engage in cooperative negotiations on behalf of the first and second party, and wherein the first agent and the second agent comprise buyer's agents; debit the fixed quantity of chips by the amount of the first bid in response to the first party being awarded the ratio of the computational resource and debiting the different quantity of chips by the amount of the second bid in response to the second party being awarded the ration of the computational resource; receiving a third bid for the computational resource using a portion of the fixed quantity of chips remaining after the debiting; and debiting the fixed quantity of chips remaining after the debiting by the portion in response to the first party being awarded the ratio of the computational resource for the pre-determined duration.
 16. The program product of claim 15, the discrete event being a scheduled auction for the computational resource.
 17. The program product of claim 16, the bid being one of a plurality of bids received pursuant to the scheduled auction for the computational resource.
 18. The program product of claim 15, the fixed quantity of chips being allocated pursuant to a business transaction.
 19. The program product of claim 18, the business transaction being a financial transaction.
 20. The program product of claim 15, the party being a business unit.
 21. The program product of claim 15, the resource unit broker selecting one of a plurality of available algorithms for identifying a winner of the computational resource. 